THE METHOD OF INFINITE DESCENT IN STABLE HOMOTOPY THEORY I January 29, 2001
نویسنده
چکیده
This paper is the first in a series aimed at clarifying and extending of parts of the last chapter of [Rav86], in which we described a method for computing the AdamsNovikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior knowledge, and neither has been improved upon since. It is generally agreed among homotopy theorists that it is not worthwhile to try to improve our knowledge of stable homotopy groups by a few stems, but that the prospect of increasing the know range by a factor of p would be worth pursuing. This possibility may be within reach now, due to a better understanding of the methods of [Rav86, Chapter 7] and improved computer technology. This paper should be regarded as laying the foundation for a program to compute π∗(S) through roughly dimension p|v2|, i.e., 432 for p = 3 and 6,000 for p = 5. The method referred to in the title involves the connective p-local ring spectra T (m) of [Rav86, §6.5], which satisfy
منابع مشابه
On the Telescopic Homotopy Theory of Spaces
In telescopic homotopy theory, a space or spectrum X is approximated by a tower of localizations LnX, n ≥ 0, taking account of vn-periodic homotopy groups for progressively higher n. For each n ≥ 1, we construct a telescopic Kuhn functor Φn carrying a space to a spectrum with the same vn-periodic homotopy groups, and we construct a new functor Θn left adjoint to Φn. Using these functors, we sho...
متن کاملThe Method of Infinite Descent in Stable Homotopy Theory I
This paper is the first in a series aimed at clarifying and extending of parts of the last chapter of [Rav86], in which we described a method for computing the AdamsNovikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior knowledge, and neither has been improv...
متن کاملDesigning stable neural identifier based on Lyapunov method
The stability of learning rate in neural network identifiers and controllers is one of the challenging issues which attracts great interest from researchers of neural networks. This paper suggests adaptive gradient descent algorithm with stable learning laws for modified dynamic neural network (MDNN) and studies the stability of this algorithm. Also, stable learning algorithm for parameters of ...
متن کاملSolvability of infinite system of nonlinear singular integral equations in the C(Itimes I, c) space and modified semi-analytic method to find a closed-form of solution
In this article, we discuss about solvability of infinite systems of singular integral equations with two variables in the Banach sequence space $C(I times I, c)$ by applying measure of noncompactness and Meir-Keeler condensing operators. By presenting an example, we have illustrated our results. For validity of the results we introduce a modified semi-analytic method in the case of tw...
متن کاملRings of Singularities
This paper is a slightly revised version of an introduction into singularity theory corresponding to a series of lectures given at the ``Advanced School and Conference on homological and geometrical methods in representation theory'' at the International Centre for Theoretical Physics (ICTP), Miramare - Trieste, Italy, 11-29 January 2010. We show how to associate to a triple of posit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004